A Systematic Simulation - based Study of Adverse Impact of Short - lived TCP Flows on Long - lived TCP Flows 1
نویسندگان
چکیده
UDP, can be used in attacks that capture unfairly large share of bandwidth compared to TCP flows. While earlier studies may have pointed out that short-lived TCP flows (mice) may hurt long-lived TCP flows (elephants) on the long term, no insight was given as to developing scenarios leading to drastic drop in throughputs of long-lived TCP flows. We have systematically developed TCP attack scenarios that differ from all prior research in that we use short-lived TCP flows to attack long-lived TCP flows. Our attacks are interesting since, (a) they are more difficult to detect, and (b) they point out the increased vulnerabilities of recently proposed scheduling, AQM and routing techniques that further favor short-lived flows. We systematically exploit the ability of TCP flows in slow-start to rapidly secure greater proportion of bandwidth compared to long-lived TCP flows in congestion avoidance phase, to a point where they drive long-lived TCP flows into timeout. We use simulations, analysis, and experiments to systematically study the dependence of the severity of impact on long-lived TCP flows on key parameters of short-lived TCP flows – including their locations, durations, and number, as well as the intervals between consecutive flows. We derive the ideal durations of, as well as the ideal intervals between, attacking short-lived TCP flows. We show that targeting bottleneck links does not always cause maximal performance degradation for the long-lived flows. In particular, our approach illustrates the interactions between TCP flows and multiple bottleneck links and their sensitivities to correlated losses in the absence of 'non-TCP friendly' flows and paves the way for a systematic synthesis of worst-case congestion scenarios. While randomly generated sequences of short-lived TCP flows may provide some reductions (up to 10%) in the throughput of the long-lived flows, we generate scenarios that cause much greater reductions (>85%). Similar scenarios achieve similar reductions for several TCP variants (Tahoe, Reno, New Reno, Sack), and for different packet drop policies (DropTail and RED). A. INTRODUCTION TCP carries 95% of today's Internet traffic and 80% of the total number of flows in the Internet [6]. A large majority of TCP flows are short-lived. The main distinction between short-lived and long-lived TCP flows (also called mice and elephants, respectively) is how the congestion window grows. Short-lived TCP flows spend most of their lifetime in the slow start phase when the congestion window is increased exponentially. Long-lived TCP flows also start in the slow start …
منابع مشابه
To Appear in Infocom 2005 TCP vs. TCP: a Systematic Study of Adverse Impact of Short-lived TCP Flows on Long-lived TCP Flows
While earlier studies have pointed out that short-lived TCP flows (mice) may hurt long-lived TCP flows (elephants) in the long term, they provide insufficient insight for developing scenarios leading to drastic drop in throughputs of long-lived TCP flows. We have systematically developed TCP adversarial scenarios where we use short-lived TCP flows to adversely influence long-lived TCP flows. Ou...
متن کاملLong-Haul TCP vs. Cascaded TCP
In this work, we investigate the bandwidth and transfer time of long-haul TCP versus cascaded TCP [5]. First, we discuss the models for TCP throughput. For TCP flows in support of bulk data transfer (i.e., long-lived TCP flows), the TCP throughput models have been derived [2, 3]. These models rely on the congestion-avoidance algorithm of TCP. Though these models cannot be applied with short-liv...
متن کاملOn the advantages of lifetime and RTT classification schemes for TCP flows
We exploit the isolation of TCP flows based on their lifetime (classified as shortor long-lived flows) to eliminate the impact of long-lived flows on the short-lived, achieving improved response time for short-lived flows. An additional classification scheme provides large-grain separation of flows with drastically different end-to-end round-trip-times (RTTs). The scheme provides long-term fair...
متن کاملDynamic Bandwidth Allocation for Lifetime-Based TCP Classification
We study the separation of TCP flows into short lived and long lived ones, and the subsequent allocation of bandwidth to reflect the dynamically changing load due to short lived flow fluctuations. Three schemes are presented to assist in determining and allocating the bandwidth to short lived flows. Each one represents a different compromise in terms of state and execution complexity. However, ...
متن کاملThe Undismissible Rats: How Do Short Connections Affect Long-Lived TCP Flows under Moderate Traffic Load?
It is well-known that the distribution of file sizes in the Internet has a long tail, and that the traffic mainly consists of small flows “the mice”, while a large portion of the bytes are sent by large flows “the elephants”. However, it is not yet well understood regarding how the mice and the elephants interact with each other when they share a common link. A simplified modelling assumption i...
متن کامل